Fast Vector Quantization Encoding Algorithms for Image Compression

نویسنده

  • Ahmed Swilem
چکیده

Vector quantization (VQ) is a well-known compression method. In the encoding phase, given a block represented as a vector, searching the closest codeword in the codebook is a time-consuming task. In this paper, two fast encoding algorithms for VQ are proposed. To reduce the search area and accelerate the search process, the first algorithm utilizes three significant features of a vector that are, the norm, and two projection angles to two projection axes. The second algorithm uses the first two features as in the first algorithm with the projection value of the vector to the second projection axe. The algorithms allow significant acceleration in the encoding process. Experimental results are presented on image block data. These results confirm the effectiveness of the proposed algorithms. DOI: 10.4018/978-1-60960-563-6.ch012

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Image Encoding Algorithm Using Vector Features

Vector quantization (VQ) is an efficient technique for image compression. However, one of the most serious problems of VQ is the heavily computational load for searching the closest codeword to the input vector in the codebook. To overcome this problem, we propose a simple and fast encoding algorithm for vector quantization. The algorithm uses three significant features of a vector, that is, th...

متن کامل

Three Improved Codebook Searching Algorithms for Image Compression Using Vector Quantizer

In this paper, we propose three improved codebook searching algorithms for vector quantization (VQ). Our improved schemes are based on three fast searching methods proposed by Huang et al., IEEE Transactions on Image Processing, 1 (3), 1992, 413–416 and the double test (DT) method proposed by Torres and Huguet, IEEE Transactions on Communications, 42 (2|3|4), 1994, 208–210. Compared with three ...

متن کامل

An efficient compression scheme for 4-D medical images using hierarchical vector quantization and motion compensation

This paper proposes an efficient compression scheme for compressing time-varying medical volumetric data. The scheme uses 3-D motion estimation to create a homogenous preprocessed data to be compressed by a 3-D image compression algorithm using hierarchical vector quantization. A new block distortion measure, called variance of residual (VOR), and three 3-D fast block matching algorithms are us...

متن کامل

Iteration Free Fractal Image Compression For Color Images Using Vector Quantization, Genetic Algorithm And Simulated Annealing

This research paper on iteration free fractal image compression for color images using the techniques Vector Quantization, Genetic Algorithm and Simulated Annealing is proposed, for lossy compression, to improve the decoded image quality, compression ratio and reduction in coding time. Fractal coding consists of the representation of image blocks through the contractive transformation coefficie...

متن کامل

A Fast Partial Distance Search Algorithm for VQ Codebook

Vector quantization (VQ) is an efficient technique for image compression. However, one of the most serious problems of VQ is the heavily computational load for searching the closest codeword to the input vector in the codebook. To overcome this problem, we propose a simple and fast partial distance search algorithm for VQ codebook by using the sum-norm pyramid structure of codewords. The propos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJMCMC

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2009